Continuity of approximation by least-squares multivariate Padé approximants
نویسندگان
چکیده
منابع مشابه
General order multivariate Padé approximants for Pseudo-multivariate functions. II
Explicit formulas for general order multivariate Padé approximants of pseudo-multivariate functions are constructed on specific index sets. Examples include the multivariate forms of the exponential function E (x) = ∞ ∑ j1,j2,...,jm=0 x1 1 x j2 2 · · ·x jm m (j1 + j2 + · · ·+ jm)! , the logarithm function L(x) = ∑ j1+j2+···+jm≥1 x1 1 x j2 2 · · ·x jm m j1 + j2 + · · ·+ jm , the Lauricella funct...
متن کاملGeneral order multivariate Padé approximants for pseudo-multivariate functions
Although general order multivariate Padé approximants were introduced some decades ago, very few explicit formulas for special functions have been given. We explicitly construct some general order multivariate Padé approximants to the class of so-called pseudo-multivariate functions, using the Padé approximants to their univariate versions. We also prove that the constructed approximants inheri...
متن کاملExploring multivariate Padé approximants for multiple hypergeometric series
We investigate the approximation of some hypergeometric functions of two variables, namely the Appell functions Fi, i = 1, . . . , 4, by multivariate Padé approximants. Section 1 reviews the results that exist for the projection of the Fi onto x = 0 or y = 0, namely, the Gauss function 2F1(a, b; c; z), since a great deal is known about Padé approximants for this hypergeometric series. Section 2...
متن کاملLeast Squares Approximation
In many applications we want to find an approximation for a function, for example for differential equations. Example problem: We want to understand how a calculator or computer can evaluate sinx for a given value x. The processor can essentially only perform addition, multiplication, division. Therefore we can try to approximate the function with a polynomial. We use the notation Pn for polyno...
متن کاملLeast-squares polynomial approximation
We construct symmetric polar WAMs (Weakly Admissible Meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(99)00177-6